POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS
نویسندگان
چکیده
منابع مشابه
Improvement Of Barreto-Voloch Algorithm For Computing $r$th Roots Over Finite Fields
Root extraction is a classical problem in computers algebra. It plays an essential role in cryptosystems based on elliptic curves. In 2006, Barreto and Voloch proposed an algorithm to compute rth roots in Fqm for certain choices of m and q. If r || q − 1 and (m, r) = 1, they proved that the complexity of their method is Õ(r(logm + log log q)m log q). In this paper, we extend the Barreto-Voloch ...
متن کاملProbability of having $n^{th}$-roots and n-centrality of two classes of groups
In this paper, we consider the finitely 2-generated groups $K(s,l)$ and $G_m$ as follows:$$K(s,l)=langle a,b|ab^s=b^la, ba^s=a^lbrangle,\G_m=langle a,b|a^m=b^m=1, {[a,b]}^a=[a,b], {[a,b]}^b=[a,b]rangle$$ and find the explicit formulas for the probability of having nth-roots for them. Also, we investigate integers n for which, these groups are n-central.
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملEfficient Computation of Roots in Finite Fields
We present an algorithm to compute r-th roots in Fqm with complexity O((logm + r log q)m log q) for certain choices of m and q. This compares well to previously known algorithms, which need O(rm log q) steps.
متن کاملOn Finding Primitive Roots in Finite Fields
We show that in any finite field Fq a primitive root can be found in time O(q’ ‘+’ ) Let Fq denote a finite field of q elements. An element 0 E IFq is called a primitive root if it generates the multiplicative group F;,“. We show that a combination of known results on distribution primitive roots and the factorization algorithm of [6] leads to a deterministic algorithm to find a primitive root ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2015
ISSN: 0304-9914
DOI: 10.4134/jkms.2015.52.1.209